A Direct Semantic Characterization of RELFUN

This is an attempt at a direct semantic formalization of rst-order relational-functional languages (the characteristic RELFUN subset) in terms of a generalized model concept. Function-deening conditional equations (or, footed clauses) and active call-by-value expressions (in clause premises) are integrated into rst-order theories. Herbrand models are accomodated to relational-functional programs by not only containing ground atoms but also ground molecules, i.e. speciic function applications paired with values. Extending SLD-resolution toward innermost conditional narrowing of relational-functional clauses, SLV-resolution is introduced, which, e.g., attens active expressions. The T P-operator is generalized analogously , e.g. by unnesting ground-clause premises. Soundness and completeness proofs for SLV-resolution naturally extend the corresponding results in logic programming.